Stress-Testing Memcomputing on Hard Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
Combinatorial Optimization Problems with Testing
In stochastic versions of combinatorial optimization problems, the goal is to optimize an objective function under constraints that specify the feasible solutions, when some parameters involve uncertainty. We focus on maximizing a linear objective ∑N i=1Wixi, where x1, . . . , xN are the decision variables, W1, . . . ,WN are mutually independent random coefficients, and the constraints are dete...
متن کاملWorkshop on Tractable special cases of hard combinatorial optimization problems
Tractable special cases through linear algebra Gerhard Woeginger, Eindhoven University of Technology, The Netherlands The talk surveys and discusses a number of tractable special cases of the travelling salesman problem and the quadratic assignment problem. As a common theme, the underlying cost matrices can be defined and easily understood through basic linear algebra: they form a cone, or a l...
متن کاملOn combinatorial testing problems
We study a class of hypothesis testing problems in which, upon observing the realization of an ndimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether there is a subset of the components belonging to a certain given class of sets whose elements have been “contaminated,” that is, have a mean different from zero. ...
متن کاملTowards Hybrid Methods for Solving Hard Combinatorial Optimization Problems
Combinatorial Optimization is a branch of optimization in applied mathematics and computer science, related to operations research, algorithm theory and computational complexity theory that sits at the intersection of many fields, such as artificial intelligence,mathematics and software engineering. Combinatorial optimization problems commonly imply finding values to a set of variables which ar...
متن کاملHeuristics from Nature for Hard Combinatorial Optimization Problems
In this paper we try to describe the main characters of Heuristics \derived" from Nature, a border area between Operations Research and Arti cial Intelligence, with applications to graph optimization problems. These algorithms take inspiration from physics, biology, social sciences, and use a certain amount of repeated trials, given by one or more \agents" operating with a mechanism of competit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2020
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2019.2927480